Hybrid CP+LNS for the Curriculum-Based Course Timetabling Problem
نویسنده
چکیده
Course Timetabling (CTT) [11] is a popular combinatorial optimization problem, which deals with generating university timetables by scheduling weekly lectures, subject to conflicts and availability constraints, while minimizing costs related to resources and user discomfort. In CB-CTT, students enrol to curricula i.e., (possibly overlapping) collections of courses. Lectures of courses pertaining to the same curriculum must therefore be scheduled at different times, so that students can attend all courses. In this paper we propose (i) a Constraint Programming (CP) model for CB-CTT and (ii) a Large Neighborhood Search (LNS) [10] strategy exploiting constraint propagation to solve hard instances of the problem. We then compare our findings against the current best results on the ITC2007 [7] testbed.
منابع مشابه
Real-life Curriculum-based Timetabling
This paper presents an innovative approach to curriculum-based timetabling. Curricula are defined by a rich model that includes optional courses and course groups among which students are expected to take a subset of courses. Transformation of the curriculum model into the enrollment model is proposed and a local search algorithm generating corresponding enrollments is introduced. This enables ...
متن کاملSolving the Course Timetabling Problem with a Hybrid Heuristic Algorithm
The problem of curriculum-based course timetabling is studied in this work. In addition to formally defining the problem, we present a hybrid solution algorithm (Adaptive Tabu Search–ATS), which is aimed at minimizing violations of soft constraints. Within ATS, a new neighborhood and a mechanism for dynamically integrating Tabu Search with perturbation (from Iterated Local Search) are proposed ...
متن کاملCurriculum-based course timetabling with SAT and MaxSAT
This paper describes our work on applying novel techniques based on propositional satisfiability (SAT) solvers and optimizers to the Curriculum-based Course Timetabling problem. Out of 32 standard benchmark instances derived from the Second International Timetabling Competition held in 2007, our techniques yield the best known solutions for 21 of them (19 of them being optimal), improving the p...
متن کاملThe Second International Timetabling Competition (ITC-2007): Curriculum-based Course Timetabling
Following the success of the First International Timetabling Competition in 2002, the timetabling research community is organising a new competition on this problem (opening August 1st). This new competition will be on three different timetabling problems, and one of the tracks concerns the course timetabling formulation that applies to Italian universities (called Curriculum-based Course Timet...
متن کاملThe Second International Timetabling Competition (ITC-2007): Curriculum-based Course Timetabling Track
Following the success of the First International Timetabling Competition in 2002, the timetabling research community is organising a new competition on this problem (opening July 22nd). This new competition will be on three different timetabling problems, and one of the tracks concerns the course timetabling formulation that applies to Italian universities (called Curriculum-based Course Timeta...
متن کامل